a new model for location-allocation problem within queuing framework

Authors

seyed hamid reza pasandideh

amirhossain chambari

abstract

this paper proposes a bi-objective model for the facility location problem under a congestion system. the idea of the model is motivated by applications of locating servers in bank automated teller machines (atms), communication networks, and so on. this model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing framework. we formulate this model with two perspectives simultaneously: (i) customers and (ii) service provider. the objectives of the model are to minimize (i) the total expected travelling and waiting time and (ii) the average facility idle-time. this model represents a mixed-integer nonlinear programming problem which belongs to the class of np-hard problems. in addition, to solve the model, two metaheuristic algorithms including non-dominated sorting genetic algorithms (nsga-ii) and non-dominated ranking genetic algorithms (nrga) are proposed. besides, to evaluate the performance of the two algorithms some numerical examples are roduced and analyzed with some metrics to determine which algorithm works better.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A New Model for Location-Allocation Problem within Queuing Framework

This paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...

full text

A New Model for Location-Allocation Problem within Queuing Framework

This paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...

full text

A multi-objective model for facility location-allocation problem with immobile servers within queuing framework

This research investigates a practical bi-objective model for the facility location–allocation (BOFLA) problemwith immobile servers and stochastic demand within the M/M/1/K queue system. The first goal of the research is to develop a mathematical model in which customers and service providers are considered as perspectives. The objectives of the developed model are minimization of the total cos...

full text

Developing a New Bi-Objective Functions Model for a Hierarchical Location-Allocation Problem Using the Queuing Theory and Mathematical Programming

In this research, a hierarchical location-allocation problem is modeled in a queue framework. The queue model is considered as M/M/1/k, in which system capacity is finite, equals to k. This is the main contribution of the current research. Customer's enters to the system in order to find the service according to a Poisson. In this problem, the hierarchical location-allocation model is considere...

full text

A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem

In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...

full text

A Nonlinear Model for a Capacitated Location-allocation Problem with Bernoulli Demand using Sub-sources

This study presents a capacitated multi-facility location-allocation problem with stochastic demands based on a well-known distribution function. In this discrete environment, besides the capacitated facilities, we can employee the capacitated sub-source of each facility for satisfying demands of customers. The objective function is to find the optimal locations of facilities among a finite num...

full text

My Resources

Save resource for easier access later


Journal title:
journal of optimization in industrial engineering

Publisher: qiau

ISSN 2251-9904

volume Volume 3

issue Issue 6 2010

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023